An Overview of Transience Bounds in Max-Plus Algebra
نویسندگان
چکیده
We survey and discuss upper bounds on the length of the transient phase of max-plus linear systems and sequences of max-plus matrix powers. In particular, we explain how to extend a result by Nachtigall to yield a new approach for proving such bounds and we state an asymptotic tightness result by using an example given by Hartmann and Arguelles.
منابع مشابه
New transience bounds for max-plus linear systems
Linear max-plus systems describe the behavior of a large variety of complex systems. It is known that these systems show a periodic behavior after an initial transient phase. Assessment of the length of this transient phase provides important information on complexity measures of such systems, and so is crucial in system design. We identify relevant parameters in a graph representation of these...
متن کاملMax-Plus algebra on tensors and its properties
In this paper we generalize the max plus algebra system of real matrices to the class of real tensors and derive its fundamental properties. Also we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverses of tensors is characterized.
متن کاملWeak CSR expansions and transience bounds in max-plus algebra
This paper aims to unify and extend existing techniques for deriving upper bounds on the transient of max-plus matrix powers. To this aim, we introduce the concept of weak CSR expansions: A = CSR⊕B. We observe that most of the known bounds (implicitly) take the maximum of (i) a bound for the weak CSR expansion to hold, which does not depend on the values of the entries of the matrix but only on...
متن کاملNew Transience Bounds for Long Walks
Linear max-plus systems describe the behavior of a large variety of complex systems. It is known that these systems show a periodic behavior after an initial transient phase. Assessment of the length of this transient phase provides important information on complexity measures of such systems, and so is crucial in system design. We identify relevant parameters in a graph representation of these...
متن کاملOn the Transience of Linear Max-Plus Dynamical Systems
We study the transients of linear max-plus dynamical systems. For that, we consider for each irreducible max-plus matrix A, the weighted graph G(A) such that A is the adjacency matrix of G(A). Based on a novel graph-theoretic counterpart to the number-theoretic Brauer’s theorem, we propose two new methods for the construction of arbitrarily long paths in G(A) with maximal weight. That leads to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1405.3458 شماره
صفحات -
تاریخ انتشار 2014